Confluence of extensional and non-extensional λ-calculi with explicit substitutions
نویسندگان
چکیده
منابع مشابه
Confluence Properties of Extensional and Non-Extensional λ-Calculi with Explicit Substitutions
This paper studies confluence properties of extensional and non-extensional λ-calculi with explicit substitutions, where extensionality is interpreted by η-expansion. For that, we propose a general scheme for explicit substitutions which describes those abstract properties that are sufficient to guarantee confluence. Our general scheme makes it possible to treat at the same time many well-known...
متن کاملConfluence Thanks to Extensional Determinism
A process is extensionally deterministic if, after any trace s and given any event a, it is either certain to accept or certain to refuse a (stably) after s. We show how several process algebras are capable of expressing this property and how they agree on the equivalence of deterministic processes. A number of important properties of processes P , including confluence, can be captured in terms...
متن کاملRewriting with Extensional Polymorphic λ-calculus
We provide a confluent and strongly normalizing rewriting system, based on expansion rules, for the extensional second order typed lambda calculus with product and unit types: this system corresponds to the Intuitionistic Positive Calculus with implication, conjunction, quantification over proposition and the constant True. This result is an important step towards a new theory of reduction base...
متن کاملExplicit Substitutions Calculi with Explicit Eta Rules
It has been argued that the notion of substitution in the λ-calculus needs to be made explicit and many calculi have been developed in which the computational steps of the substitution operation involved in β-contractions have been atomised. In contrast to the great variety of developments for making explicit formalisations of the Beta rule, less work has been done for giving explicit definitio...
متن کاملEeciency of -calculi with Explicit Substitutions
We introduce a criterion of eeciency to simulate-reduction in calculi of explicit substitutions and we apply it to several calculi: , * , , s, t and u. The latter is presented here for the rst time and may be considered as an eecient variant of s. The results of this paper imply that calculi a la s are usually more eecient at simulating-reduction than calculi in the-style. In fact, we prove tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00166-2